Learning Image Representations by Completing Damaged Jigsaw Puzzles
نویسندگان
چکیده
In this paper, we explore methods of complicating selfsupervised tasks for representation learning. That is, we do severe damage to data and encourage a network to recover them. First, we complicate each of three powerful self-supervised task candidates: jigsaw puzzle, inpainting, and colorization. In addition, we introduce a novel complicated self-supervised task called “Completing damaged jigsaw puzzles” which is puzzles with one piece missing and the other pieces without color. We train a convolutional neural network not only to solve the puzzles, but also generate the missing content and colorize the puzzles. The recovery of the aforementioned damage pushes the network to obtain robust and general-purpose representations. We demonstrate that complicating the self-supervised tasks improves their original versions and that our final task learns more robust and transferable representations compared to the previous methods, as well as the simple combination of our candidate tasks. Our approach achieves state-of-the-art performance in transfer learning on PASCAL classification and semantic segmentation.
منابع مشابه
Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzles
In this paper we study the problem of image representation learning without human annotation. Following the principles of selfsupervision, we build a convolutional neural network (CNN) that can be trained to solve Jigsaw puzzles as a pretext task, which requires no manual labeling, and then later repurposed to solve object classification and detection. To maintain the compatibility across tasks...
متن کاملA shape and image merging technique to solve jigsaw puzzles
This paper proposes an algorithm for solving subsets of typical (canonical) jigsaw puzzles. This algorithm combines shape and image matching with a cyclic ‘‘growth’’ process that tries to place pieces in their correct positions. First, the jigsaw pieces are extracted from the input image. Then, the corner points of the jigsaw pieces are detected. Next, piece classification and recognition are p...
متن کاملNo Easy Puzzles: A Hardness Result for Jigsaw Puzzles
We show that solving jigsaw puzzles requires Θ(n ) edge matching comparisons, making them as hard as their trivial upper bound. This result generalises to puzzles of all shapes, and is applicable to both pictorial and apictorial puzzles.
متن کاملLAJANUGEN LOGESWARAN : SOLVING JIGSAW PUZZLES USING PATHS AND CYCLES 1 Solving Jigsaw Puzzles using Paths and Cycles
There has been a growing interest in image jigsaw puzzles with square shaped pieces. A solver takes as input square shaped patches of the same size belonging to an image and attempts to reconstruct the image. The key components of a jigsaw solver are a compatibility metric and an assembly algorithm. A compatibility metric uses the color content of the image patches to identify which pairs of pi...
متن کاملProject Title - Puzzle Solver EE 368 – Digital Image Processing
Most jigsaw puzzles that are available today consist of several 100 pieces of a single image, and can take several hours to solve. This project proposes to solve the puzzle simply by using a picture of all of the pieces, and an image of the final solution. Keywords-component; jigsaw puzzle; Scale Invariant Feature Transform;SIFT
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1802.01880 شماره
صفحات -
تاریخ انتشار 2018